Verification of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic
نویسندگان
چکیده
We give a survey of our recent and current work on the specification and verification of timed algorithms within a rather complete logical framework where timed Gurevich Abstract State Machines (GASM) are used to specify algorithms. The time we use is continuous as it is usual in specifications of control systems and often of protocols (discrete time can be treated within the same framework but it is less intuitive and harder to treat when automating the verification process). The topics addressed in this survey concern semantics of timed GASM, representation of this semantics in a first order logic adapted to verification, heuristic considerations that are implied by the used type of GASM and that help to automate the verification.
منابع مشابه
Verification of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic
متن کامل
A Tool for Automated Verification of Parameterized Timed Algorithms
We present a tool developed for automated verification of parameterized real-time systems. Algorithm specification is provided as Timed Gurevich Abstract State Machines while requirements are expressed as formulas of the First Order Timed Logic (FOTL). In our framework, the semantics of an ASM is also defined as a FOTL-formula. Thus any verification problem amounts to proving the validity of so...
متن کاملAutomatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems. Systems are modeled with basic Gurevich abstract state machines (ASMs), and requirements are expressed in a first order timed logic (FOTL). FOTL is undecidable, however the protocol we study is in a decidable class of p...
متن کاملAutomatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems. Systems are modeled with basic Gurevich abstract state machines (ASMs), and requirements are expressed in a first order timed logic (FOTL). FOTL is undecidable, however the protocol we study is in a decidable class of p...
متن کاملOn Veriication of Reenements of Asynchronous Timed Distributed Algorithms
This work is an attempt to apply Gurevich Abstract State Machines methodology to the veriication of reenements of real-time distributed asynchronous algorithms. If to deene the reenement following the semantical framework of observability, that seems to be reasonable, the reenement of timed programs is not a simple replacement of a part of a program by its detalization. As an example to illustr...
متن کامل